Labelling algorithms for paired-domination problems in block and interval graphs
نویسندگان
چکیده
منابع مشابه
Labelling algorithms for paired-domination problems in block and interval graphs
Let G = (V ,E) be a graph without isolated vertices. A set S ⊆ V is a paired-dominating set if every vertex in V − S is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination problem is to determine the paired-domination number, which is the minimum cardinality of a paired-dominating set. Motivated by a mistaken algorithm given by Chen, Kang a...
متن کاملFe b 20 08 Labelling Algorithms for Paired - domination Problems in Block and Interval Graphs ∗
Let G = (V,E) be a graph without isolated vertices. A set S ⊆ V is a paired-domination set if every vertex in V − S is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination problem is to determine the paired-domination number, which is the minimum cardinality of a paired-dominating set. Motivated by a mistaken algorithm given by Chen, Kang an...
متن کاملLinear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs
In a graph G, a vertex subset S ⊆ V (G) is said to be a dominating set of G if every vertex not in S is adjacent to a vertex in S. A dominating set S of a graph G is called a paired-dominating set if the induced subgraph G[S] contains a perfect matching. The paired-domination problem involves finding a smallest paired-dominating set of G. Given an intersection model of an interval graph G with ...
متن کاملNew Algorithms for Weighted $k$-Domination and Total $k$-Domination Problems in Proper Interval Graphs
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating set, is a set of vertices such that every vertex of the graph has at least k neighbors in the set. The problems of finding the minimum size of a k-dominating, resp. total k-d...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2008
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-008-9177-6